Kraft-chaitin Inequality Revisited 1
نویسندگان
چکیده
Kraft's inequality [9] is essential for the classical theory of noiseless coding [1, 8]. In algorithmic information theory [5, 7, 2] one needs an extension of Kraft's condition from nite sets to (in nite) recursively enumerable sets. This extension, known as Kraft-Chaitin Theorem, was obtained by Chaitin in his seminal paper [4] (see also, [3, 2]). The aim of this note is to o er a simpler proof of Kraft-Chaitin Theorem based on a new construction of the pre x-free code.
منابع مشابه
Kraft - Chaitin Inequality
Kraft’s inequality [9] is essential for the classical theory of noiseless coding [1, 8]. In algorithmic information theory [5, 7, 2] one needs an extension of Kraft’s condition from finite sets to (infinite) recursively enumerable sets. This extension, known as Kraft-Chaitin Theorem, was obtained by Chaitin in his seminal paper [4] (see also, [3, 2], [10]). The aim of this note is to offer a si...
متن کاملFree-Extendible Prefix-Free Sets and an Extension of the Kraft-Chaitin Theorem
First, the dual set of a finite prefix–free set is defined. Using this notion we describe equivalent conditions for a finite prefix–free set to be indefinitely extendible. This lead to a simple proof for the Kraft– Chaitin Theorem. Finally, we discuss the influence of the alphabet size on the indefinite extensibility property.
متن کاملSome Coding Theorems Ongeneralized Havrda-charvat and Tsallis’s Entropy
∈∆N ), (1.1) where the convention 0log(0)= 0 is adapted, (see Shannon [19]). Throughout this paper, ∑ will stand for ∑N i=1 unless otherwise stated and logarithms are taken to the baseD (D > 1). Let a finite set of N input symbols X = {x1, x2, . . . ,xN } be encoded using alphabet of D symbols, then it has been shown by Feinstien [6] that there is a uniquely decipherable code with lengths n1,n2...
متن کاملComplexity and Randomness
2 Random finite strings 7 2.1 Plain Kolmogorov complexity . . . . . . . . . . . . . . . . . . 7 2.2 Prefix-free complexity . . . . . . . . . . . . . . . . . . . . . . 8 2.3 Kraft inequality, Shannon-Fano code . . . . . . . . . . . . . . 9 2.4 The universal semimeasure m . . . . . . . . . . . . . . . . . . 10 2.5 A priori probability . . . . . . . . . . . . . . . . . . . . . . . . 11 2.6 Coding,...
متن کاملSuper - State Automata and Rational
We introduce the notion of super-state automaton constructed from another automaton. This construction is used to solve an open question about enumerative sequences in rational trees. We prove that any IN-rational sequence s = (sn) n0 of nonnegative integers satisfying the Kraft inequality P n0 snk ?n 1 is the enumerative sequence of leaves by height of a k-ary rational tree. This result had be...
متن کامل